von Neumann ordinal - определение. Что такое von Neumann ordinal
Diclib.com
Словарь ChatGPT
Введите слово или словосочетание на любом языке 👆
Язык:

Перевод и анализ слов искусственным интеллектом ChatGPT

На этой странице Вы можете получить подробный анализ слова или словосочетания, произведенный с помощью лучшей на сегодняшний день технологии искусственного интеллекта:

  • как употребляется слово
  • частота употребления
  • используется оно чаще в устной или письменной речи
  • варианты перевода слова
  • примеры употребления (несколько фраз с переводом)
  • этимология

Что (кто) такое von Neumann ordinal - определение

MATHEMATICAL CONCEPT
Initial ordinal; Von Neumann cardinal
Найдено результатов: 4500
von Neumann ordinal         
  • A graphical "matchstick" representation of the ordinal ω². Each stick corresponds to an ordinal of the form ω·''m''+''n'' where ''m'' and ''n'' are natural numbers.
ORDER TYPE OF A WELL-ORDERED SET
Ordinal numbers; Von Neumann ordinal; Ordinal Number; Ordinal (mathematics); Transfinite ordinal number; Transfinite ordinal numbers; Finite ordinal number; Ordinal number (finite); Transfinite sequence; Ω (ordinal number); Ordinal number (mathematics); O (ordinal number); Ordinal number (set theory); Least infinite ordinal; Second number class; First number class; Omega (set theory); Ω+1; First infinite ordinal; First infinite ordinal number; Countable ordinals; Countable ordinal; Von Neumann definition of ordinals; Von Neumann encoding; Number class; Omega (ordinal); Von Neumann ordinals
<mathematics> An implementation of ordinals in set theory (e.g. Zermelo Frankel set theory or ZFC). The von Neumann ordinal alpha is the well-ordered set containing just the ordinals "shorter" than alpha. "Reasonable" set theories (like ZF) include Mostowski's Collapsing Theorem: any well-ordered set is isomorphic to a von Neumann ordinal. In really screwy theories (e.g. NFU -- New Foundations with Urelemente) this theorem is false. The finite von Neumann ordinals are the {von Neumann integers}. (1995-03-30)
ordinal number         
  • A graphical "matchstick" representation of the ordinal ω². Each stick corresponds to an ordinal of the form ω·''m''+''n'' where ''m'' and ''n'' are natural numbers.
ORDER TYPE OF A WELL-ORDERED SET
Ordinal numbers; Von Neumann ordinal; Ordinal Number; Ordinal (mathematics); Transfinite ordinal number; Transfinite ordinal numbers; Finite ordinal number; Ordinal number (finite); Transfinite sequence; Ω (ordinal number); Ordinal number (mathematics); O (ordinal number); Ordinal number (set theory); Least infinite ordinal; Second number class; First number class; Omega (set theory); Ω+1; First infinite ordinal; First infinite ordinal number; Countable ordinals; Countable ordinal; Von Neumann definition of ordinals; Von Neumann encoding; Number class; Omega (ordinal); Von Neumann ordinals
¦ noun a number defining a thing's position in a series, such as 'first' or 'second'.
ordinal number         
  • A graphical "matchstick" representation of the ordinal ω². Each stick corresponds to an ordinal of the form ω·''m''+''n'' where ''m'' and ''n'' are natural numbers.
ORDER TYPE OF A WELL-ORDERED SET
Ordinal numbers; Von Neumann ordinal; Ordinal Number; Ordinal (mathematics); Transfinite ordinal number; Transfinite ordinal numbers; Finite ordinal number; Ordinal number (finite); Transfinite sequence; Ω (ordinal number); Ordinal number (mathematics); O (ordinal number); Ordinal number (set theory); Least infinite ordinal; Second number class; First number class; Omega (set theory); Ω+1; First infinite ordinal; First infinite ordinal number; Countable ordinals; Countable ordinal; Von Neumann definition of ordinals; Von Neumann encoding; Number class; Omega (ordinal); Von Neumann ordinals
(ordinal numbers)
An ordinal number or an ordinal is a word such as 'first', 'third', and 'tenth' that tells you where a particular thing occurs in a sequence of things. Compare cardinal number
.
N-COUNT
Ordinal number         
  • A graphical "matchstick" representation of the ordinal ω². Each stick corresponds to an ordinal of the form ω·''m''+''n'' where ''m'' and ''n'' are natural numbers.
ORDER TYPE OF A WELL-ORDERED SET
Ordinal numbers; Von Neumann ordinal; Ordinal Number; Ordinal (mathematics); Transfinite ordinal number; Transfinite ordinal numbers; Finite ordinal number; Ordinal number (finite); Transfinite sequence; Ω (ordinal number); Ordinal number (mathematics); O (ordinal number); Ordinal number (set theory); Least infinite ordinal; Second number class; First number class; Omega (set theory); Ω+1; First infinite ordinal; First infinite ordinal number; Countable ordinals; Countable ordinal; Von Neumann definition of ordinals; Von Neumann encoding; Number class; Omega (ordinal); Von Neumann ordinals
In set theory, an ordinal number, or ordinal, is a generalization of ordinal numerals (first, second, th, etc.) aimed to extend enumeration to infinite sets.
John von Neumann Theory Prize         
AWARD
John Von Neumann Theory Prize; Von Neumann Theory Prize; John von neumann prize
The John von Neumann Theory Prize of the Institute for Operations Research and the Management Sciences (INFORMS)
von Neumann architecture         
  • Single [[system bus]] evolution of the architecture
COMPUTER ARCHITECTURE
Von Neumann bottleneck; Von Neumann computer; Von Neumann model; Princeton architecture; Von neumann architecture; Von Neumann Model; Stored program concept; Stored-program architecture; Von Neumann style; Non-Von Neumann architecture; Von Neumann computer architecture; Von Neumann Architecture; Non-von Neumann architecture; Neumann architecture; Van Neumann architecture; Von Neuman architecture; Van Neuman architecture
<architecture, computability> A computer architecture conceived by mathematician John von Neumann, which forms the core of nearly every computer system in use today (regardless of size). In contrast to a Turing machine, a von Neumann machine has a random-access memory (RAM) which means that each successive operation can read or write any memory location, independent of the location accessed by the previous operation. A von Neumann machine also has a central processing unit (CPU) with one or more registers that hold data that are being operated on. The CPU has a set of built-in operations (its instruction set) that is far richer than with the Turing machine, e.g. adding two binary integers, or branching to another part of a program if the binary integer in some register is equal to zero (conditional branch). The CPU can interpret the contents of memory either as instructions or as data according to the {fetch-execute cycle}. Von Neumann considered parallel computers but recognized the problems of construction and hence settled for a sequential system. For this reason, parallel computers are sometimes referred to as non-von Neumann architectures. A von Neumann machine can compute the same class of functions as a universal Turing machine. [Reference? Was von Neumann's design, unlike Turing's, originally intended for physical implementation?] von Neumann architecturetevans/VonNeuma.htm">http://salem.mass.edu/von Neumann architecturetevans/VonNeuma.htm. (2003-05-16)
Von Neumann architecture         
  • Single [[system bus]] evolution of the architecture
COMPUTER ARCHITECTURE
Von Neumann bottleneck; Von Neumann computer; Von Neumann model; Princeton architecture; Von neumann architecture; Von Neumann Model; Stored program concept; Stored-program architecture; Von Neumann style; Non-Von Neumann architecture; Von Neumann computer architecture; Von Neumann Architecture; Non-von Neumann architecture; Neumann architecture; Van Neumann architecture; Von Neuman architecture; Van Neuman architecture
The von Neumann architecture — also known as the von Neumann model or Princeton architecture — is a computer architecture based on a 1945 description by John von Neumann, and by others, in the First Draft of a Report on the EDVAC. The document describes a design architecture for an electronic digital computer with these components:
Finite von Neumann algebra         
VON NEUMANN ALGEBRA IN WHICH EVERY ISOMETRY IS UNITARY
Finite dimensional von neumann algebra; Finite dimensional von Neumann algebra; Finite-dimensional von Neumann algebra
In mathematics, a finite von Neumann algebra is a von Neumann algebra in which every isometry is a unitary. In other words, for an operator V in a finite von Neumann algebra if V^*V = I, then VV^* = I.
John von Neumann         
  • [[Flow chart]] from von Neumann's "Planning and coding of problems for an electronic computing instrument", published in 1947
  • Implosion mechanism
  • Los Alamos]] ID badge photo
  • Von Neumann's gravestone
  • History of approaches that led to NBG set theory
  • Friedrich-Wilhelms-Universität Berlin]] announcing Neumann's lectures on the theory of functions II, axiomatic set theory and mathematical logic, the mathematical colloquium, review of recent work in quantum mechanics, special functions of mathematical physics and Hilbert's proof theory. He also lectured on the theory of relativity, set theory, integral equations and analysis of infinitely many variables.
  • Von Neumann's birthplace, at 16 Báthory Street, Budapest. Since 1968, it has housed the [[John von Neumann Computer Society]].
  • pmid=8942052}}</ref> Three generations of machine are shown: the second has nearly finished constructing the third. The lines running to the right are the tapes of genetic instructions, which are copied along with the body of the machines.
  • [[Operation Redwing]] nuclear test in July 1956
  • A simple configuration in von Neumann's cellular automaton. A binary signal is passed repeatedly around the blue wire loop, using excited and quiescent ''ordinary transmission states''. A confluent cell duplicates the signal onto a length of red wire consisting of ''special transmission states''. The signal passes down this wire and constructs a new cell at the end. This particular signal (1011) codes for an east-directed special transmission state, thus extending the red wire by one cell each time. During construction, the new cell passes through several sensitised states, directed by the binary sequence.
  • The von Neumann crater, on the far side of the Moon
HUNGARIAN-AMERICAN MATHEMATICIAN AND POLYMATH (1903–1957)
John Von Neumann; Jon von Neumann; Neumann, John von; Johann von Neumann; Johnny von Neumann; János Neumann; Neumann János; Von Neuman; John v. Neumann; J. von Neumann; Dr. John Von Neumann; John von neumann; John von Neuman; Janos Lajos Neumann; János Lajos Neumann; John von neuman; Margittai Neumann János Lajos; Janos Neumann; Neumann Janos; Jon Von Neumann; Margittai Neumann Janos Lajos; Johann Von Neumann; János von Neumann; Jon van Newman; Neumann János Lajos
<person> /jon von noy'mahn/ Born 1903-12-28, died 1957-02-08. A Hungarian-born mathematician who did pioneering work in quantum physics, game theory, and computer science. He contributed to the USA's Manhattan Project that built the first atomic bomb. von Neumann was invited to Princeton University in 1930, and was a mathematics professor at the {Institute for Advanced Studies} from its formation in 1933 until his death. From 1936 to 1938 Alan Turing was a visitor at the Institute and completed a Ph.D. dissertation under von Neumann's supervision. This visit occurred shortly after Turing's publication of his 1934 paper "On Computable Numbers with an Application to the Entscheidungs-problem" which involved the concepts of logical design and the universal machine. von Neumann must have known of Turing's ideas but it is not clear whether he applied them to the design of the IAS Machine ten years later. While serving on the BRL Scientific Advisory Committee, von Neumann joined the developers of ENIAC and made some critical contributions. In 1947, while working on the design for the successor machine, EDVAC, von Neumann realized that ENIAC's lack of a centralized control unit could be overcome to obtain a rudimentary stored program computer. He also proposed the fetch-execute cycle. His ideas led to what is now often called the von Neumann architecture. von Neumannmbsclass/is2000/hall_of_fame/vonneuma.htm">http://sis.pitt.edu/John von Neumannmbsclass/is2000/hall_of_fame/vonneuma.htm. von Neumannhistory/VonNeumann.html">http://ei.cs.vt.edu/John von Neumannhistory/VonNeumann.html. von Neumannmike/comphist/54nord/">http://ftp.arl.mil/John von Neumannmike/comphist/54nord/. (2004-01-14)
Franz Neumann (architect)         
AUSTRIAN ARCHITECT AND POLITICIAN
Franz von Neumann
Franz Ritter von Neumann the Younger (January 16, 1844, Vienna – February 1, 1905, Vienna) was an Austrian architect.

Википедия

Von Neumann cardinal assignment

The von Neumann cardinal assignment is a cardinal assignment that uses ordinal numbers. For a well-orderable set U, we define its cardinal number to be the smallest ordinal number equinumerous to U, using the von Neumann definition of an ordinal number. More precisely:

| U | = c a r d ( U ) = inf { α O N   |   α = c U } , {\displaystyle |U|=\mathrm {card} (U)=\inf\{\alpha \in \mathrm {ON} \ |\ \alpha =_{c}U\},}

where ON is the class of ordinals. This ordinal is also called the initial ordinal of the cardinal.

That such an ordinal exists and is unique is guaranteed by the fact that U is well-orderable and that the class of ordinals is well-ordered, using the axiom of replacement. With the full axiom of choice, every set is well-orderable, so every set has a cardinal; we order the cardinals using the inherited ordering from the ordinal numbers. This is readily found to coincide with the ordering via ≤c. This is a well-ordering of cardinal numbers.